Block-diagonalisation of Matrices and Operators
نویسنده
چکیده
In this short note we deal with a constructive scheme to decompose a continuous family of matrices A(ρ) asymptotically as ρ → 0 into blocks corresponding to groups of eigenvalues of the limit matrix A(0). We also discuss the extension of the scheme to matrix families depending upon additional parameters and operators on Hilbert spaces. 1. Matrix theory 1.1. Preliminaries. We first recall some well-known facts about matrix equations of Sylvester type and their solution. Let A, A ∈ C be two matrices with Re specA > 0, Re specA < 0. (1) Then a solution to the Sylvester equation AX −XA = B (2) for a given right hand side B ∈ C can be represented by the integral X = ∫ ∞ 0 e + Be − dt. (3) Indeed, by assumption (1) we know that there exists a constant c > 0 such that the matrix exponentials satisfy ‖e + ‖ ‖e − ‖ . e and the integral converges exponentially. Furthermore, plugging (3) into (2) immediately yields AX −XA = ∫ ∞ 0 ( Ae + Be − − e + Be − A )
منابع مشابه
Some inequalities involving lower bounds of operators on weighted sequence spaces by a matrix norm
Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...
متن کاملOrthonormal approximate joint block-diagonalization Bloc-diagonalisation simultanée approchée avec contrainte orthonormale
The aim of this work is to give a comprehensive overview of the problem of jointly block-diagonalizing a set of matrices. We discuss how to implement methods in the common case of only approximative block-diagonalizability using Jacobi algorithms. Standard Jacobi optimization techniques for diagonalization and joint diagonalization are reviewed first, before we study their generalizations to th...
متن کاملDiagonal multi - matrix correlators and BPS operators in N = 4 SYM
We present a complete basis of multi-trace multi-matrix operators that has a diagonal two point function for the free matrix field theory at finite N . This generalises to multiple matrices the single matrix diagonalisation by Schur polynomials. Crucially, it involves intertwining the gauge group U(N) and the global symmetry group U(M) with Clebsch-Gordan coefficients of symmetric groups Sn. Wh...
متن کاملOn the unitary diagonalisation of a special class of quaternion matrices
We propose a unitary diagonalisation of a special class of quaternion matrices, the socalled η-Hermitian matrices A = AηH , η ∈ {ı, ȷ, κ} arising in widely linear modelling. In 1915, Autonne exploited the symmetric structure of a matrix A = AT to propose its corresponding factorisation (also knownas the Takagi factorisation) in the complex domain C. Similarly, we address the factorisation of an...
متن کاملDouble-null operators and the investigation of Birkhoff's theorem on discrete lp spaces
Doubly stochastic matrices play a fundamental role in the theory of majorization. Birkhoff's theorem explains the relation between $ntimes n$ doubly stochastic matrices and permutations. In this paper, we first introduce double-null operators and we will find some important properties of them. Then with the help of double-null operators, we investigate Birkhoff's theorem for descreate $l^p$ sp...
متن کامل